Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(a(a(b(a(x1))))))) → a(b(a(a(b(a(a(a(b(x1)))))))))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a(a(b(a(a(b(a(x1))))))) → a(b(a(a(b(a(a(a(b(x1)))))))))

Q is empty.

Termination of the TRS R could be shown with a Match Bound [6,7] of 2. This implies Q-termination of R.
The following rules were used to construct the certificate:

a(a(b(a(a(b(a(x1))))))) → a(b(a(a(b(a(a(a(b(x1)))))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 10, 6, 7, 3, 4, 9, 8, 5, 18, 14, 15, 11, 12, 17, 16, 13, 26, 22, 23, 19, 20, 25, 24, 21, 34, 30, 31, 27, 28, 33, 32, 29, 42, 38, 39, 35, 36, 41, 40, 37, 50, 46, 47, 43, 44, 49, 48, 45

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges: